The (signless) Laplacian spectral radius of unicyclic and bicyclic graphs with n vertices and k pendant vertices
نویسندگان
چکیده
منابع مشابه
The spectral radius of unicyclic and bicyclic graphs with n vertices and k pendant vertices
In this paper, we determine graphs with the largest spectral radius among all the unicyclic and all the bicyclic graphs with n vertices and k pendant vertices, respectively. © 2005 Elsevier Inc. All rights reserved. AMS classification: 05C50
متن کاملThe Signless Laplacian Spectral Radius for Bicyclic Graphs with k Pendant Vertices
In this paper, we study the signless Laplacian spectral radius of bicyclic graphs with given number of pendant vertices and characterize the extremal graphs.
متن کاملThe (signless) Laplacian spectral radii of c-cyclic graphs with n vertices and k pendant vertices
A connected graph is called a c-cyclic graph if it contains n vertices and n + c − 1 edges. Let C(n, k, c) denote the class of connected c-cyclic graphs with n vertices and k pendant vertices. Recently, the unique extremal graph, which has greatest (respectively, signless) Laplacian spectral radius, in C(n, k, c) has been determined for 0 ≤ c ≤ 3, k ≥ 1 and n ≥ 2c + k + 1. In this paper, the un...
متن کاملThe least eigenvalue of the signless Laplacian of non-bipartite unicyclic graphs with k pendant vertices
Let U(n, k) be the set of non-bipartite unicyclic graphs with n vertices and k pendant vertices, where n ≥ 4. In this paper, the unique graph with the minimal least eigenvalue of the signless Laplacian among all graphs in U(n, k) is determined. Furthermore, it is proved that the minimal least eigenvalue of the signless Laplacian is an increasing function in k. Let Un denote the set of non-bipar...
متن کاملEla the (signless) Laplacian Spectral Radii of C-cyclic Graphs with N Vertices and K Pendant Vertices
A connected graph is called a c-cyclic graph if it contains n vertices and n + c − 1 edges. Let C(n, k, c) denote the class of connected c-cyclic graphs with n vertices and k pendant vertices. Recently, the unique extremal graph, which has greatest (respectively, signless) Laplacian spectral radius, in C(n, k, c) has been determined for 0 ≤ c ≤ 3, k ≥ 1 and n ≥ 2c + k + 1. In this paper, the un...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Czechoslovak Mathematical Journal
سال: 2010
ISSN: 0011-4642,1572-9141
DOI: 10.1007/s10587-010-0053-z